Down the Borel hierarchy: Solving Muller games via safety games
نویسندگان
چکیده
We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player. This yields a novel antichain-based memory structure and a natural notion of permissive strategies for Muller games. Moreover, we generalize our construction by presenting a new type of game reduction from infinite games to safety games and show its applicability to several other winning conditions.
منابع مشابه
Solving Muller Games via Safety Games
We show how to transform a Muller game with n vertices into a safety game with (n!) vertices whose solution allows to determine the winning regions of the Muller game and a winning strategy for one player.
متن کاملSolving infinite games with bounds
We investigate the existence and the complexity of computing and implementing optimal winning strategies for graph games of infinite duration. Parameterized linear temporal logics are extensions of Linear Temporal Logic (LTL) by temporal operators equipped with variables for time bounds. In model-checking, such specifications were introduced as “PLTL” by Alur et al. and as “PROMPT-LTL” by Kupfe...
متن کاملWhat kind of memory is needed to win infinitary Muller games?
In an influential paper entitled “How much memory is needed to win infinite games”, Dziembowski, Jurdziński, and Walukiewicz have shown that there are Muller games of size O(n) whose winning strategies require memory of size at least n!. This shows that the LAR-memory, based on the latest appearance records introduced by Gurevich and Harrington, is optimal for solving Muller games. We review th...
متن کاملWhat kind of memory is needed to win infinitary
In an influential paper entitled “How much memory is needed to win infinite games”, Dziembowski, Jurdziński, and Walukiewicz have shown that there are Muller games of size O(n) whose winning strategies require memory of size at least n!. This shows that the LAR-memory, based on the latest appearance records introduced by Gurevich and Harrington, is optimal for solving Muller games. We review th...
متن کاملGames with Winning Conditions of High Borel Complexity
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary finite Borel complexity....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 560 شماره
صفحات -
تاریخ انتشار 2014